--- print prime numbers

package examples.Euler7 where

import examples.EulerLib


--- give some integers > 0
main :: [String] -> IO ()
main = println
            • map (either (const (-1n)) ((primes !!) • (subtract 1))) -- get corresponding prime
            • filter (either (const false) (>0))        -- make sure its right and > 0
            • map String.int                            -- [String] -> [Exception Int]
